On the Use of Advanced Logic Programming Languages in Computational Linguistics Solange Coupet-grimal Et Olivier Ridoux
نویسندگان
چکیده
Computational Linguistics and Logic Programming have strong connections, but the former uses concepts that are absent from the most familiar implementations of the latter. We advocate that a Logic Programming language needs not feature the Computational Linguistics concepts exactly, it must only provide a logical way of dealing with them. We focus on the manipulation of higher-order terms and the logical handling of context, and we show that the advanced features of Prolog II and Prolog are useful for dealing with these concepts. Higher-order terms are native in Prolog, and Prolog II's innnite trees provide a handy data-structure for manipulating them. The formulas language of Prolog can be transposed in the Logic Grammar realm to allow for a logical handling of context. Sur l'usage de langages de programmation logique avanc es en informatique linguistique R esum e : L'informatique linguistique et la programmation logique ont des liens tr es forts, mais la premi ere utilise souvent des concepts qui n'appartiennent pas aux mises en uvre les plus courantes de la seconde. Nous arguons qu'un langage de programmation logique ne doit pas n ecessairement proposer exactement les concepts utilis es en informatique linguistique, mais seulement un moyen logique de les emuler. Nous nous int eressons plus particuli erement a la manipulation des termes d'ordre sup erieur et a la prise en compte logique du contexte, et nous montrons que les dispositifs avanc es de Prolog II et Prolog sont utiles pour les emuler. Les termes d'ordres sup erieur sont indig enes a Prolog, tandis que Prolog II oore une structure de donn ee commode pour les emuler. Le langage de formule de Prolog peut ^ etre adapt e a un formalisme de grammaire logique pour permettre la gestion logique du contexte.
منابع مشابه
On the Use of Advanced Logic Programming Languages in Computational Linguistics
Computational Linguistics and Logic Programming have strong connections , but the former uses concepts that are absent from the most familiar implementations of the latter. We advocate that a Logic Programming language need not feature the Computational Linguistics concepts exactly, it must only provide a logical way of dealing with them. We focus on the manipulation of higher-order terms and t...
متن کاملShort Presentation: A Functional Scenario for Bytecode Verification of Space Bounds
We define a simple stack machine for a first-order functional language and show how to perform type, size, and termination verifications at the level of the bytecode of the machine. In particular, we show that a combination of size verification based on quasi-interpretations and of termination verification based on lexicographic path orders leads to an explicit polynomial bound on the space req...
متن کاملI S a P U B L I C a T I O N I N T E R N E N O I R I S a Imagining Clp(, )
We study under which conditions the domain of-terms (() and the equality theory of the-calculus () form the basis of a usable constraint logic programming language (CLP). The conditions are that the equality theory must contain axiom , and the formula language must depart from Horn clauses and accept universal quantiications and implications in goals. In short, CLP((,) must be close to Prolog. ...
متن کاملHardware Verification Using Co-induction in COQ
This paper presents a toolbox implemented in Coq and dedicated to the speciication and veriication of synchronous sequential devices. The use of Coq co-inductive types underpins our methodology and leads to elegant and uniform descriptions of the circuits and their behaviours as well as clear and short proofs. An application to a non trivial circuit is given as an illustration.
متن کاملCoq and Hardware Verification: A Case Study
We present, on the example of a left-to-right comparator, several approaches for verifying a class of circuits with the Coq proof-assistant. The great expressiveness of the Calculus of Inductive Constructions allows us to give precise and general speciications. Thanks to Coq's higher-order logic, we state general results for establishing the correctness of such circuits. Finally, exploiting the...
متن کامل